Validity of Heavy Traffic Steady-State Approximations in Open Queueing Networks
نویسندگان
چکیده
We consider a single class open queueing network, also known as a Generalized Jackson Network (GJN). A classical result in heavy traffic theory asserts that the sequence of normalized queue length processes of the GJN converge weakly to a Reflected Brownian Motion (RBM) in the orthant, as the traffic intensity approaches unity. However, barring simple instances, it is still not known whether the stationary distribution of RBM provides a valid approximation for the steady-state of the original network. In this paper we resolve this open problem by proving that the re-scaled stationary distribution of the GJN converges to the stationary distribution of the RBM, thus validating a so-called “interchange-of-limits” for this class of networks. Our method of proof involves a combination of Lyapunov function techniques, strong approximations, and tail probability bounds that yield tightness of the sequence of stationary distributions of the GJN. Short Title: Steady-state approximations in open queueing networks
منابع مشابه
Validity of Heavy Traffic Steady - State Approximations in Generalized Jackson Networks
We consider a single class open queueing network, also known as a generalized Jackson network (GJN). A classical result in heavy-traffic theory asserts that the sequence of normalized queue length processes of the GJN converge weakly to a reflected Brownian motion (RBM) in the orthant, as the traffic intensity approaches unity. However, barring simple instances, it is still not known whether th...
متن کاملValidity of Heavy Traffic Steady-state Approximations in Generalized Jackson Networks by David Gamarnik
We consider a single class open queueing network, also known as a generalized Jackson network (GJN). A classical result in heavy-traffic theory asserts that the sequence of normalized queue length processes of the GJN converge weakly to a reflected Brownian motion (RBM) in the orthant, as the traffic intensity approaches unity. However, barring simple instances, it is still not known whether th...
متن کاملValidity of Heavy-Traffic Steady-State Approximations in Multiclass Queueing Networks: The Case of Queue-Ratio Disciplines
A class of stochastic processes known as semi-martingale reflecting Brownian motions (SRBMs) is often used to approximate the dynamics of heavily loaded queueing networks. In two influential papers, Bramson (1998) and Williams (1998) laid out a general and structured approach for proving the validity of such heavy-traffic approximations, in which an SRBM is obtained as a diffusion limit from a ...
متن کاملSteady state approximations of limited processor sharing queues in heavy traffic
We investigate steady state properties of limited processor sharing queues in heavy traffic. Our analysis builds on previously obtained process limit theorems, and requires the interchange of steady state and heavy traffic limits, which are established by a coupling argument. The limit theorems yield explicit approximations of the steady state queue length and response time distribution in heav...
متن کاملA New View of the Heavy-Traffic Limit Theorem for Infinite-Server Queues
This paper presents a new approach for obtaining heavy-traffic limits for infinite-server queues and open networks of infinite-server queues. The key observation is that infinite-server queues having deterministic service times can easily be analyzed in terms of the arrival counting process. A variant of the same idea applies when the service times take values in a finite set, so this is the ke...
متن کامل